Alternating-time stream logic for multi-agent systems
نویسندگان
چکیده
منابع مشابه
Alternating-Time Stream Logic for Multi-agent Systems
Constraint automata have been introduced to provide a compositional, operational semantics for the exogenous coordination language Reo, but they can also serve interface specification for components and an operational model for other coordination languages. Constraint automata have been used as basis for equivalence checking and model checking temporal logical properties. The main contribution ...
متن کاملPDT Logic for Stream Reasoning in Multi-agent Systems
We present Probabilistic Doxastic Temporal (PDT) Logic for streams, a formalism to reason about probabilistic beliefs and their infinite temporal evolution in multi-agent systems. Extending previous work on PDT Logic, this formalism builds on a Markov chain model to represent infinite streams of possible worlds. Within these streams, it enables the quantification of beliefs through probability ...
متن کاملVariable Structure Behavioural Controller for Multi-agent Systems
In previous papers authors have considered agents as inertia-less self driven particles and designed a flocking algorithm. Application of this algorithm to agents with considerable inertial characteristics needs a behavioural controller. The controller uses the local information and helps every agent to imitate the desired behaviour as a member of the flocking frame which covers the main is...
متن کاملBDI : An Alternating-time BDI Logic for Multiagent Systems
Many logics for modelling beliefs, desires and intentions of agents, such as Rao and Georgeff’s BDI logic and Wooldridge’s LORA, are based on temporal logics like CTL/CTL∗ (Computational Tree Logic) in which the structure of time is branching in the future and linear in the past. Recently, many attempts have been made to define logics for BDI agents by using extensions of CTL. In this paper, we...
متن کاملAlternating-time dynamic logic
We propose Alternating-time Dynamic Logic (ADL) as a multi-agent variant of Dynamic Logic in which atomic programs are replaced by coalitions. In ADL, the Dynamic Logic operators are parametrised with regular expressions over coalitions and tests. Such regular expressions describe the dynamic structure of a coalition. This means that, when moving from Dynamic Logic to ADL, the focus shifts away...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2010
ISSN: 0167-6423
DOI: 10.1016/j.scico.2009.07.007